翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク mathematics of cyclic redundancy checks ： ウィキペディア英語版 mathematics of cyclic redundancy checks The cyclic redundancy check (CRC) is based on division in the ring of polynomials over the finite field GF(2) (the integers modulo 2), that is, the set of polynomials where each coefficient is either zero or one, and arithmetic operations wrap around. Any string of bits can be interpreted as the coefficients of a message polynomial of this sort, and to find the CRC, we multiply the message polynomial by $x^n$ and then find the remainder when dividing by the degree-$n$ generator polynomial. The coefficients of the remainder polynomial are the bits of the CRC. ==Math== In general, computation of CRC corresponds to Euclidean division of polynomials over GF(2): :$M(x)\; \backslash cdot\; x^n\; =\; Q(x)\; \backslash cdot\; G(x)\; +\; R(x).$ Here $M(x)$ is the original message polynomial and $G(x)$ is the degree-$n$ generator polynomial. The bits of $M(x)\; \backslash cdot\; x^n$ are the original message with $n$ zeroes added at the end. The CRC 'checksum' is formed by the coefficients of the remainder polynomial $R(x)$ whose degree is strictly less than $n$. The quotient polynomial $Q(x)$ is of no interest. Using modulo operation, it can be stated that :$R(x)\; =\; M(x)\; \backslash cdot\; x^n\; \backslash ,\backslash bmod\backslash ,\; G(x).$ In communication, the sender attaches the $n$ bits of R after the original message bits of M, which could be shown to be equivalent to sending out $M(x)\; \backslash cdot\; x^n\; -\; R(x)$ (the ''codeword''.) The receiver, knowing $G(x)$ and therefore $n$, separates M from R and repeats the calculation, verifying that the received and computed R are equal. If they are, then the receiver assumes the received message bits are correct. In practice CRC calculations most closely resemble long division in binary, except that the subtractions involved do not borrow from more significant digits, and thus become exclusive or operations. A CRC is a checksum in a strict mathematical sense, as it can be expressed as the weighted modulo-2 sum of per-bit syndromes, but that word is generally reserved more specifically for sums computed using larger moduli, such as 10, 256, or 65535. CRCs can also be used as part of error-correcting codes, which allow not only the detection of transmission errors, but the reconstruction of the correct message. These codes are based on closely related mathematical principles. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「mathematics of cyclic redundancy checks」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.